Ruler: Programming Type Rules
نویسندگان
چکیده
Some type systems are first described formally, to be sometimes followed by an implementation. Other type systems are first implemented as a language extension, to be sometimes retrofitted into a formal description. In neither case it is an easy task to keep both artefacts consistent. In this paper we present Ruler, a domain specific language for type rules. Our prototype compiler for Ruler both generates (1) a visual LTEX rendering, suitable for use in the presentation of formal aspects, and (2) an attribute grammar based implementation. Uniting these two aspects in Ruler contributes to bridging the gap between theory and practice: mutually consistent representations can be generated for use in both theoretical and practical settings.
منابع مشابه
A Constraint-Based Approach to the Golomb Ruler Problem
A Golomb ruler with m marks can be defined as a set of m distinct integers such that the differences between them are all distinct. An optimal Golomb ruler minimizes the value of the largest mark. The Golomb ruler problem is highly combinatorial and difficult to solve efficiently even for small sizes. Golomb rulers and related problems play an important role in, e.g., radio communication, VLSI ...
متن کاملA Lagrangian Relaxation for Golomb Rulers
The Golomb Ruler Problem asks to position n integer marks on a ruler such that all pairwise distances between the marks are distinct and the ruler has minimum total length. It is a very challenging combinatorial problem, and provably optimal rulers are only known for n up to 26. Lower bounds can be obtained using Linear Programming formulations, but these are computationally expensive for large...
متن کاملEquivalence of some LP-based lower bounds for the Golomb ruler problem
The Golomb Ruler problem consists in finding n integers such that all possible differences are distinct and such that the largest difference is minimum. We review three lower bounds based on linear programming that have been proposed in the literature for this problem, and propose a new one. We then show that these 4 lower bounds are equal. Finally we discuss some computational experience aimin...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملIntegrating Relaxations for Combinatorial Optimization
In this thesis we explore two methods of computing lower bounds. We first discuss the Lagrangian Relaxation as it applies to the Golomb ruler problem, and then we explore adding multi-valued decision diagrams to an additive bounding scheme. The Golomb Ruler Problem asks to position n integer marks on a ruler such that all pairwise distances between the marks are distinct and the ruler has minim...
متن کامل